Termination Proof Script
Consider the TRS R consisting of the rewrite rules
|
| 1: |
|
f(x,x) |
→ f(i(x),g(g(x))) |
| 2: |
|
f(x,y) |
→ x |
| 3: |
|
g(x) |
→ i(x) |
| 4: |
|
f(x,i(x)) |
→ f(x,x) |
| 5: |
|
f(i(x),i(g(x))) |
→ a |
|
There are 4 dependency pairs:
|
| 6: |
|
F(x,x) |
→ F(i(x),g(g(x))) |
| 7: |
|
F(x,x) |
→ G(g(x)) |
| 8: |
|
F(x,x) |
→ G(x) |
| 9: |
|
F(x,i(x)) |
→ F(x,x) |
|
The approximated dependency graph contains one SCC:
{6,9}.
-
Consider the SCC {6,9}.
The usable rules are {3}.
The constraints could not be solved.
Tyrolean Termination Tool (0.01 seconds)
--- May 4, 2006